﻿

# achromatic number

мат.
ахроматическое число

English-Russian scientific dictionary. 2008.

### Смотреть что такое "achromatic number" в других словарях:

• Abbe number — An Abbe diagram plots the Abbe number against refractive index for a range of different glasses (red dots). Glasses are classified using the Schott Glass letter number code to reflect their composition and position on the diagram …   Wikipedia

• Complete coloring — of the Clebsch graph with 8 colors. Every pair of colors appears on at least one edge. No complete coloring with more colors exists: in any 9 coloring some color would appear only at one vertex, and there would not be enough neighboring vertices… …   Wikipedia

• Crown graph — Crown graphs with six, eight, and ten vertices. In graph theory, a branch of mathematics, a crown graph on 2n vertices is an undirected graph with two sets of vertices ui and vi and with an edge from ui to vj whenever i ≠ j. The crown… …   Wikipedia

• Hypercube graph — The hypercube graph Q4 Vertices 2n Edges 2n−1n …   Wikipedia

• Hadwiger conjecture (graph theory) — In graph theory, the Hadwiger conjecture (or Hadwiger s conjecture) states that, if an undirected graph G requires k or more colors in any vertex coloring, then one can find k disjoint connected subgraphs of G such that each subgraph is connected …   Wikipedia

• Harmonious coloring — of 7 tree with 3 levels using 12 colors. The harmonius chromatic number of this graph is 12 since the vertices are 57, and the color s pair are ncolor*(ncolor 1)/2 >= 57 iff ncolor>=12. Moreover (3/2)*(7+1)=12(see Mitchem s Formula).In graph… …   Wikipedia

• List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… …   Wikipedia

• Clebsch graph — Named after Alfred Clebsch Vertices 16 Edges 40 …   Wikipedia

• Exact coloring — The n coloring of Complete graph K n is an exact coloring.In graph theory, an exact coloring is a (proper) vertex coloring in which every pair of colors appears on exactly one pair of adjacent vertices. In essence, an exact coloring is a coloring …   Wikipedia

• Nombre Achromatique — En théorie des graphes, une coloration complète est l opposé d une coloration harmonieuse en ce sens que c est une coloration des sommets dans laquelle toute paire de couleurs apparait au moins sur une paire de sommets adjacents. Le nombre… …   Wikipédia en Français

• Nombre achromatique — En théorie des graphes, une coloration complète est l opposé d une coloration harmonieuse en ce sens que c est une coloration des sommets dans laquelle toute paire de couleurs apparait au moins sur une paire de sommets adjacents. Le nombre… …   Wikipédia en Français

### Поделиться ссылкой на выделенное

##### Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.